M ay 2 00 2 Brownian Bridge and Self - Avoiding Random Walk
نویسنده
چکیده
We derive the Brownian bridge asymptotics for a scaled self-avoiding walk conditioned on arriving to a far away point n~a for ~a ∈ (Z, 0, ..., 0), and outline the proof for all other ~a in Zd.
منابع مشابه
Bond - True Self - Avoiding Walk on Z
Thètrue' self-avoiding walk with bond repulsion is a nearest neighbour random walk on Z, for which the probability of jumping along a bond of the lattice is proportional to exp(?g number of previous jumps along that bond). First we prove a limit theorem for the distribution of the local time process of this walk. Using this result, later we prove a local limit theorem, as A ! 1, for the distrib...
متن کاملLong-range self-avoiding walk converges to α-stable processes
Abstract: We consider a long-range version of self-avoiding walk in dimension d > 2(α ∧ 2), where d denotes dimension and α the power-law decay exponent of the coupling function. Under appropriate scaling we prove convergence to Brownian motion for α ≥ 2, and to α-stable Lévy motion for α < 2. This complements results by Slade (1988), who proves convergence to Brownian motion for nearest-neighb...
متن کاملWeak Interaction Limits for One-dimensional Random Polymers
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our method is based on cutting the path into pieces of an appropriately scaled length, controlling the interaction between the different pieces, and applying an inv...
متن کاملCritical Behaviour of Self-avoiding Walk in Five or More Dimensions
We use the lace expansion to prove that in five or more dimensions the standard self-avoiding walk on the hypercubic (integer) lattice behaves in many respects like the simple random walk. In particular, it is shown that the leading asymptotic behaviour of the number of «-step self-avoiding walks is purely exponential, that the mean square displacement is asymptotically linear in the number of ...
متن کاملScaling Limit of Loop-erased Random Walk
The loop-erased random walk (LERW) was first studied in 1980 by Lawler as an attempt to analyze self-avoiding walk (SAW) which provides a model for the growth of a linear polymer in a good solvent. The self-avoiding walk is simply a path on a lattice that does not visit the same site more than once. Proving things about the collection of all such paths is a formidable challenge to rigorous math...
متن کامل